Shuffled Frog Leaping Algorithm based Unequal Clustering Strategy for Wireless Sensor Networks

نویسنده

  • Xunli FAN
چکیده

In energy-limited WSNs, coverage and connectivity are two of the most fundamental QoS issues, which have a great impact on the performance of WSNs for minimizing the node energy consumption and maximizing the network coverage lifetime. Due to the node distribution, the energy consumption among nodes is more imbalanced in cluster-based WSNs. Based on this problem, this paper proposes Sink Mobility based Energy Balancing Unequal Clustering protocol (SMEBUC) for WSNs with node distribution, which chooses the nodes with more energy as cluster heads and divides all nodes into clusters of different size through the improved Shuffled Frog Leaping Algorithm (SFLA). To reduce the cluster head replacement frequency, cluster head serves continuously to determine the cluster head exchange time and nodes weight. The greedy algorithm is adopted to select the optimal relay node between cluster head and Sink. To further reduce the energy consumption, mobile Sink routing is put forward to avoid the hot-spots. We evaluate and compare the performance of SMEBUC with LEACH and EBUCP, and the results show that SMEBUC achieves more energy savings, and energy balance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Bio-Inspired Clustering Algorithm for Energy Efficient Wireless Sensor Networks

In order to achieve the sensing, communication and processing tasks of Wireless Sensor Networks, an energy-efficient routing protocol is required to manage the dissipated energy of the network and to minimalize the traffic and the overhead during the data transmission stages. Clustering is the most common technique to balance energy consumption amongst all sensor nodes throughout the network. I...

متن کامل

Improved Shuffled Frog Leaping Algorithm And Its Application In Node Localization Of Wireless Sensor Network

To improve the unreasonable distribution of sensors' random deployment and increase network coverage rate, an optimization method of wireless sensor networks coverage based on improved shuffled frog leaping algorithm (ISFLA) was proposed in this paper.During the process of updating the frog, a novel learning strategy is introduced, in which the poor frog learns not only from the best frog of it...

متن کامل

Using the Modified Shuffled Frog Leaping Algorithm for Optimal Sizing and location of Distributed Generation Resources for Reliability Improvement

Restructuring the recent developments in the power system and problems arising from construction as well as the maintenance of large power plants lead to increase in using the Distributed Generation (DG) resources. DG units due to its specifications, technology and location network connectivity can improve system and load point reliability indices. In this paper, the allocation and sizing of di...

متن کامل

Use of the Improved Frog-Leaping Algorithm in Data Clustering

Clustering is one of the known techniques in the field of data mining where data with similar properties is within the set of categories. K-means algorithm is one the simplest clustering algorithms which have disadvantages sensitive to initial values of the clusters and converging to the local optimum. In recent years, several algorithms are provided based on evolutionary algorithms for cluster...

متن کامل

Shuffled Frog-Leaping Programming for Solving Regression Problems

There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015